Modelization and Simulation of Parallel Relational Query Execution Plans Using Dpl Graphs and High-level Petri Nets. Ecole Normale Supérieure De Lyon Modelization and Simulation of Parallel Relational Query Execution Plans Using Dpl Graphs and High-level Petri Nets
نویسندگان
چکیده
This report presents a novel representation model of parallel relational query execution plans, called DPL graphs. This model allows to deal with any kind of parallel architecture and any kind of parallel execution strategy. Based on an analysis of execution dependencies between operators, this model allows to precisely represent communications, run-time control mechanisms, scheduling constraints or speciic processing strategies (e.g. bucket processing). This report especially focus on the modelization and the simulation of the data and control ows which are realized using high-level Petri nets. Dans ce rapport nous introduisons un nouveau mod ele de repr esentation d'un plan d'ex ecution parall ele d'une requ^ ete relationnelle, appel e DPL graphs. Ce mod ele nous permet de mod eliser toutes sortes de strat egies d'ex ecution par-all eles sur n'importe quelle architecture parall ele. Il se base sur une analyse compl ete des d ependences existantes entre des op erateurs relationels ex ecut es en parall ele et int egre en m^ eme temps les communications, le contr^ ole d'ex ecution, les contraintes d'ordonnancement et de traitements sp eciiques (ex. traitement par bucket). Ce rapport se concentre sur la mod elisation et la simulation du ux de contr^ ole et de donn ees qui sont r ealis ees a l'aide de r eseaux de Petri. Mots-cl es: Bases de donn ees parall eles, optimisation de requ^ etes pour l'ex ecution paral-l ele, plan d'ex ecution parall ele, graph d`ordonnancement, r eseau de Petri.
منابع مشابه
From the modeling of parallel query processing to the query optimization and simulation
This paper presents a novel theoretical model for representing parallel relational query processing. It is based on a hierarchical approach. First, a scheme graph, called DPL graph, describes all possible execution dependencies between operators, including communication and run-time control mechanisms. Second, a high-level Petri net is used for modeling the data-and control ow. Our model provid...
متن کاملHow to Build up an Efficient Simulation Tool for Complex Parallel Relational Query Processing Based on High-Level Petri Nets
متن کامل
Petri Net Based Algorithm Modelization and Parallel Execution on Symmetric Multiprocessors
PDPTA 2014 The Symmetric Multiprocessors architecture is composed by a complex set of cores, chips and memory channels that make it difficult to implement a parallel program that efficiently uses all resources. Another obstacle for achieving a performance according the resources is added by algorithms with hard data dependency. Asynchronicity is a key to get all processors running. Petri Nets h...
متن کاملParallel Asynchronous Modelization and Execution of Cholesky Algorithm using Petri Nets
PDPTA 2013 Parallelization of algorithms with hard data dependency has a need of task synchronization. Synchronous parallel versions are simple to model and program, but inefficient in terms of scalability and processors use rate. The same problem for Asynchronous versions with elemental static task scheduling. Efficient Asynchronous algorithms implement out-of-order execution and are complex t...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کامل